Linear Time Algorithm for the Generalised Longest Common Repeat Problem
نویسندگان
چکیده
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U , considering direct, inverted, mirror as well as everted repeats. In this paper we define the generalised longest common repeat problem, where we can set the number of times that a repeat should appear in each string. We present a linear time algorithm for this problem using the suffix array. We also show an application of our algorithm for finding a longest common substring which appears only in a subset U ′ of U but not in U − U ′.
منابع مشابه
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T`}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U . We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem.
متن کاملAn almost-linear time and linear space algorithm for the longest common subsequence problem
There are two general approaches to the longest common subsequence problem. The dynamic programming approach takes quadratic time but linear space, while the non-dynamic-programming approach takes less time but more space. We propose a new implementation of the latter approach which seems to get the best for both time and space for the
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کامل(In)approximability Results for Pattern Matching Problems
We consider the approximability of three recently introduced pattern matching problems which have been shown to be NP-hard. Given two strings as input, the first problem is to find the longest common parameterised subsequence between two strings. The second is a maximisation variant of generalised function matching and the third is a a maximisation variant of generalised parameterised matching....
متن کاملSublinear Space Algorithms for the Longest Common Substring Problem
Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). However, the use of linear space is impractical in many applications. In this paper we show that for any trade-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005